翻訳と辞書 Words near each other ・ Knight v. Commissioner ・ Knight v. Jewett ・ Knight Vinke Asset Management ・ Knight Vision ・ Knight Watchman ・ Knight Without Armour ・ Knight Without Armour (novel) ・ Knight XV ・ Knight's Armament Company ・ Knight's Armament Company PDW ・ Knight's Cove ・ Knight's Cross ・ Knight's Cross of the Iron Cross ・ Knight's fee ・ Knight's Gambit ・ Knight's graph ・ Knight's Hill (Tulse Hill) ・ Knight's Hill (ward) ・ Knight's Hill (West Norwood) ・ Knight's Pass ・ Knight's Point ・ Knight's Spider Web Farm ・ Knight's tour ・ Knight, Death and the Devil ・ Knight, U.S. Virgin Islands ・ Knight, Wisconsin ・ Knight-Allen House ・ Knight-Bagehot Fellowship Program ・ Knight-errant ・ Knight-Finch House Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Knight's graph ： ウィキペディア英語版 Knight's graph In graph theory, a knight's graph, or a knight's tour graph, is a graph that represents all legal moves of the knight chess piece on a chessboard where each vertex represents a square on a chessboard and each edge is a legal move. More specifically, an $n\; \backslash times\; m$ knight's tour graph is a knight's tour graph of an $n\; \backslash times\; m$ chessboard.〔.〕 For a $n\; \backslash times\; m$ knight's tour graph the total number of vertices is simply $nm$. For a $n\; \backslash times\; n$ knight's tour graph the total number of vertices is simply $n^2$ and the total number of edges is $4(n-2)(n-1)$. A Hamiltonian path on the knight's tour graph is a knight's tour.〔 Schwenk's theorem characterizes the sizes of chessboard for which a knight's tour exist.〔.〕 ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Knight's graph」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.